package com.zwj.interview.二叉树之使用两个队列;

/**
 * 二叉树的广度优先遍历
 */
public class TreeNode {

    public int val;

    public TreeNode right;

    public TreeNode left;

    public TreeNode(int value) {
        this.val = value;
    }
}
